Labeled partitions with colored permutations
نویسندگان
چکیده
In this paper, we extend the notion of labeled partitions with ordinary permutations to colored permutations in the sense that the colors are endowed with a cyclic structure. We use labeled partitions with colored permutations to derive the generating function of the fmajk indices of colored permutations. The second result is a combinatorial treatment of a relation on the q-derangement numbers with respect to colored permutations which leads to the formula of Chow for signed permutations and the formula of Faliharimalala and Zeng [10] on colored permutations. The third result is an involution on permutations that implies the generating function formula for the signed q-counting of the major indices due to Gessel and Simon. This involution can be extended to signed permutations. In this way, we obtain a combinatorial interpretation of a formula of Adin, Gessel and Roichman.
منابع مشابه
Avoiding Colored Partitions of Lengths Two and Three
Pattern avoidance in the symmetric group Sn has provided a number of useful connections between seemingly unrelated problems from stack-sorting to Schubert varieties. Recent work [3, 9, 10, 11] has generalized these results to Sn o Cc, the objects of which can be viewed as “colored permutations”. Another body of research that has grown from the study of pattern avoidance in permutations is patt...
متن کاملCombinatorics of stable polynomials and correlation inequalities
This thesis contains five papers divided into two parts. In the first part, Papers I–IV, we study polynomials within the field of combinatorics. Here we study combinatorial properties as well as the zero distribution of the polynomials in question. The second part consists of Paper V, where we study correlating events in randomly oriented graphs. In Paper I we give a new combinatorial interpret...
متن کاملA Survey on Partially Ordered Patterns
The paper offers an overview over selected results in the literature on partially ordered patterns (POPs) in permutations, words and compositions. The POPs give rise in connection with co-unimodal patterns, peaks and valleys in permutations, Horse permutations, Catalan, Narayana, and Pell numbers, bi-colored set partitions, and other combinatorial objects.
متن کاملAvoiding Colored Partitions of Two Elements in the Pattern Sense
Enumeration of pattern-avoiding objects is an active area of study with connections to such disparate regions of mathematics as Schubert varieties and stack-sortable sequences. Recent research in this area has brought attention to colored permutations and colored set partitions. A colored partition of a set S is a partition of S with each element receiving a color from the set [k] = {1, 2, . . ...
متن کاملCounting Genus One Partitions and Permutations
We prove the conjecture by M. Yip stating that counting genus one partitions by the number of their elements and blocks yields, up to a shift of indices, the same array of numbers as counting genus one rooted hypermonopoles. Our proof involves representing each genus one permutation by a four-colored noncrossing partition. This representation may be selected in a unique way for permutations con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 309 شماره
صفحات -
تاریخ انتشار 2009